Automatic construction of restriction site maps
نویسنده
چکیده
A computer program is described which constructs maps of restriction endonuclease cleavage sites in DNA molecules, given only the fragment lengths. The program utilizes fragment length data from single and double restriction enzyme digests to generate maps for linear or circular molecules. The search for a map can be limited to the unknown (insert) region of a recombinant phage or plasmid. Typical restriction maps with four or five enzymes which cut at three to five unknown sites can be calculated in a few minutes.
منابع مشابه
Z-Cognitive Map: An Integrated Cognitive Maps and Z-Numbers Approach under Cognitive Information
Usually, in real-world engineering problems, there are different types of uncertainties about the studied variables, which can be due to the specific variables under investigation or interaction between them. Fuzzy cognitive maps, which addresses the cause-effect relation between variables, is one of the most common models for better understanding of the problems, especially when the quantitati...
متن کاملPMAP, PMAPS: DNA physical map constructing programs
Computer programs are described, which facilitate the construction of the restriction site (physical) map of DNA molecules. By knowing the length of each fragment and its degree of error in the single and the double restriction enzyme digestions, the programs give all the possibilities for the physical map. This method is applicable to linear DNA molecules. Several examples are presented which ...
متن کاملBanach module valued separating maps and automatic continuity
For two algebras $A$ and $B$, a linear map $T:A longrightarrow B$ is called separating, if $xcdot y=0$ implies $Txcdot Ty=0$ for all $x,yin A$. The general form and the automatic continuity of separating maps between various Banach algebras have been studied extensively. In this paper, we first extend the notion of separating map for module case and then we give a description of a linear se...
متن کاملAutomatic continuity of almost multiplicative maps between Frechet algebras
For Fr$acute{mathbf{text{e}}}$chet algebras $(A, (p_n))$ and $(B, (q_n))$, a linear map $T:Arightarrow B$ is textit{almost multiplicative} with respect to $(p_n)$ and $(q_n)$, if there exists $varepsilongeq 0$ such that $q_n(Tab - Ta Tb)leq varepsilon p_n(a) p_n(b),$ for all $n in mathbb{N}$, $a, b in A$, and it is called textit{weakly almost multiplicative} with respect to $(p_n)$ and $(q_n)$...
متن کاملConstruction of a recombinant vector for site-directed mutagenesis in Salmonella typhimurium
BACKGROUND: Among all common techniques in sitedirectedmutagenesis, λ Red recombinase system has beenwidely used to knock out chromosomal genes in bacteria. In thismethod, there is always the risk of DNA Linear digestion byhost's restriction enzymes that leads to the low frequency ofrecombination. OBJECTIVES:To overcome this, we constructeda recombinant vector to disrupt phoP gene in Salmonella...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Nucleic acids research
دوره 10 1 شماره
صفحات -
تاریخ انتشار 1982